Intersection Checking for Regular Expressions Based on Inference System
نویسندگان
چکیده
منابع مشابه
Checking Determinism of Regular Expressions with Counting
We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|ΣE ||E|) time algorithm to check whether an expression E with counting is strongly deterministic where ΣE is the set of distinct symbols in E. It improves the previous upper bound of O(|E|) time on the same decision problems for both standard regular expressions and regular exp...
متن کاملPosition Automaton Construction for Regular Expressions with Intersection
Positions and derivatives are two essential notions in the conversion methods from regular expressions to equivalent finite automata. Partial derivative based methods have recently been extended to regular expressions with intersection. In this paper, we present a position automaton construction for those expressions. This construction generalizes the notion of position making it compatible wit...
متن کاملAutomata Construction for Regular Expressions in Model Checking
Industrial temporal languages like PSL/Sugar and ForSpec have augmented the language with Regular Expressions (REs). An RE specification represents a sequence of Boolean events a model may or may not exhibit. A common way of using REs for specification is in a negative way: a not RE! property describes an undesirable behavior of the model. A not r! formula has the nature that it is sufficient t...
متن کاملRegular Model Checking Using Inference of Regular Languages
Regular model checking is a method for verifying infinite-state systems based on coding their configurations as words over a finite alphabet, sets of configurations as finite automata, and transitions as finite transducers. We introduce a new general approach to regular model checking based on inference of regular languages. The method builds upon the observation that for infinite-state systems...
متن کاملSuccinctness of Regular Expressions with Interleaving, Intersection and Counting
Studying the impact of operations, such as intersection and interleaving, on the succinctness of regular expressions has recently received renewed attention [12–14]. In this paper, we study the succinctness of regular expressions (REs) extended with interleaving, intersection and counting operators. We show that in a translation from REs with interleaving to standard regular expressions a doubl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Theory and Application
سال: 2015
ISSN: 2005-4270,2005-4270
DOI: 10.14257/ijdta.2015.8.4.24